(sort-fold-case): New variable.

(sort-subr): Bind case-fold-search from sort-fold-case.

diff --git a/lisp/sort.el b/lisp/sort.el
index 0ee90121ae080f21482a32fbd54af25d51b5db67..93c8f2171be09645be7a5e40287963791404bbcb 100644 (file)
--- a/lisp/sort.el
+++ b/lisp/sort.el
@@ -29,6 +29,9 @@
 
 ;;; Code:
 
+(defvar sort-fold-case nil
+  "*Non-nil if the buffer sort functions should ignore case.")
+
 (defun sort-subr (reverse nextrecfun endrecfun &optional startkeyfun endkeyfun)
   "General text sorting routine to divide buffer into records and sort them.
 Arguments are REVERSE NEXTRECFUN ENDRECFUN &optional STARTKEYFUN ENDKEYFUN.
@@ -69,7 +72,8 @@ same as ENDRECFUN."
       (if messages (message "Finding sort keys..."))
       (let* ((sort-lists (sort-build-lists nextrecfun endrecfun
                                           startkeyfun endkeyfun))
-            (old (reverse sort-lists)))
+            (old (reverse sort-lists))
+            (case-fold-search sort-fold-case))
        (if (null sort-lists)
            ()
          (or reverse (setq sort-lists (nreverse sort-lists)))